Hashing protocol for distilling multipartite CSS states

摘要

We present a hashing protocol for distilling multipartite CSS states by meansof local Clifford operations, Pauli measurements and classical communication.It is shown that this hashing protocol outperforms previous versions byexploiting information theory to a full extent an not only applying CNOTs aslocal Clifford operations. Using the information-theoretical notion of astrongly typical set, we calculate the asymptotic yield of the protocol as thesolution of a linear programming problem.